#!/usr/bin/env python
# -*- coding: utf-8 -*-
# @Time    : 2020/6/17 11:23
# @USER    : Shengji He
# @File    : BestSightseeingPair.py
# @Software: PyCharm
# @Version  : Python-
# @TASK:
from typing import List

class Solution:
    def maxScoreSightseeingPair(self, A: List[int]) -> int:
        """
        Given an array A of positive integers, A[i] represents the value of the i-th sightseeing spot, and two
        sightseeing spots i and j have distance j - i between them.

        The score of a pair (i < j) of sightseeing spots is (A[i] + A[j] + i - j) : the sum of the values of the
        sightseeing spots, minus the distance between them.

        Return the maximum score of a pair of sightseeing spots.

        Example 1:
            Input: [8,1,5,2,6]

            Output: 11

            Explanation: i = 0, j = 2, A[i] + A[j] + i - j = 8 + 5 + 0 - 2 = 11

        Note:
            - 2 <= A.length <= 50000
            - 1 <= A[i] <= 1000

        :param A:
        :return:
        """
        ans = 0
        a = A[0] + 0
        for i in range(1, len(A)):
            ans = max(ans, a + A[i] - i)
            a = max(a, A[i] + i)

        return ans


if __name__ == '__main__':
    S = Solution()
    A = [8, 1, 5, 2, 6]
    print(S.maxScoreSightseeingPair(A))
    print('done')
